Longest common substring problem - PDFSEARCH.IO - Document Search Engine

Longest common substring problem
Results: 22

#	Item
11	CS109A Notes for LectureSubstrings In ML notation, x is a substring of y if y = u^x^v for some strings u and v. Similar notion for lists, i.e., y = u@x@v. Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:58:15 Combinatorics Formal languages Longest common subsequence problem String Substring Subsequence Diff Shortest common supersequence Longest common substring problem Mathematics Dynamic programming Theoretical computer science
12	The Uncertainty of Identity Toolset: Analysing Digital Traces for User Profiling Muhammad Adnan Antonio Lima Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2015-03-30 09:11:09 Combinatorics Dynamic programming Formal languages Family name Genealogy Suffix tree Longest common substring problem Suffix array Substring Computing Surnames Technology
13	Window Subsequence Matching Window Subsequence Problems for Compressed Texts INPUT: Text: C O M P U T E R Add to Reading List Source URL: yury.name Language: English - Date: 2006-06-11 02:51:26 Dynamic programming Combinatorics Mathematical optimization Logicians Yuri Matiyasevich Compressed pattern matching Longest common subsequence problem Substring X Window System Mathematics Software Theoretical computer science
14	Memory Efficient Minimum Substring Partitioning Yang Li, Pegah Kamousi, Fangqiu Han, Shengqi Yang, Xifeng Yan, Subhash Suri University of California, Santa Barbara {yangli, pegah, fhan, sqyang, xyan, suri}@cs.ucsb.edu A Add to Reading List Source URL: www.vldb.org Language: English - Date: 2013-02-20 04:21:38 DNA sequencing Velvet assembler Comparison of programming languages Substring Hash function Partition Disk partitioning Longest common substring problem Rabin–Karp algorithm Mathematics String Computing
15	FCPM: Problem Description New Algorithms on Compressed Texts Fully Compressed Pattern Matching (FCPM) INPUT: Compressed strings P and T OUTPUT: Yes/No (whether P is a substring in T ?) Add to Reading List Source URL: yury.name Language: English - Date: 2006-03-17 20:59:12 Dynamic programming Pattern matching Data compression Mathematical optimization String Substring Compressed pattern matching Longest common subsequence problem Yuri Matiyasevich Mathematics Theoretical computer science Applied mathematics
16	Journal of Computer and System Sciences SS1389 journal of computer and system sciences 52, 299307[removed]article no[removed]Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files Amihood Amir* Add to Reading List Source URL: tandem.bu.edu Language: English - Date: 2003-10-08 11:50:42 Suffix tree Dynamic programming String matching algorithms Trie String searching algorithm Substring Huffman coding Lempel–Ziv–Welch Longest common substring problem String Computing Computer programming
17	Complexity across morphological paradigms: A minimum description length approach to identifying inflectional stems Jackson L. Lee and John A. Goldsmith {jsllee,goldsmith}@uchicago.edu University of Chicago Overview: Give Add to Reading List Source URL: jacksonllee.com Language: English - Date: 2014-10-22 18:57:08 Theoretical computer science Linguistic morphology Morphology Combinatorics Dynamic programming Word stem Subsequence Substring Longest common subsequence problem Mathematics Linguistics Grammar
18	PDF Document Add to Reading List Source URL: media.wiley.com Language: English - Date: 2013-08-24 07:18:22 Dynamic programming Formal languages Arrays Suffix array Suffix tree Longest common substring problem Linguistic morphology Substring Longest repeated substring problem String Mathematics Computing
19	Algorithms on Strings, Trees, and Sequences Dan Gusfield University of California, Davis Cambridge University Press 1997 Add to Reading List Source URL: webdiis.unizar.es Language: English - Date: 2014-01-10 10:35:51 Combinatorics Dynamic programming Suffix tree Formal languages Aho–Corasick string matching algorithm String searching algorithm Longest common substring problem Substring Knuth–Morris–Pratt algorithm String Mathematics String matching algorithms
20	ERA: Efficient Serial and Parallel Suffix Tree Construction for Very Long Strings Essam Mansour1 Add to Reading List Source URL: www.vldb.org Language: English - Date: 2011-09-28 10:12:24 Dynamic programming Suffix tree Analysis of algorithms Suffix array Longest common substring problem Algorithm Trie String searching algorithm Time complexity Theoretical computer science Mathematics String